Homotopies for Solving Polynomial Systems Within a Bounded Domain
نویسندگان
چکیده
The problem considered in this paper is the computation of all solutions of a given polynomial system in a bounded domain. Proving Rouché’s Theorem by homotopy continuation concepts yields a new class of homotopy methods, the socalled regional homotopy methods. These methods rely on isolating a part of the system to be solved, which dominates the rest of the system on the border of the domain. As the dominant part has a sparser structure, it is easier to solve. It will be used as start system in the regional homotopy. The paper further describes practical homotopy construction methods by presenting estimators to obtain bounds for polynomials over a bounded domain. Applications illustrate the usefulness of the approach.
منابع مشابه
Numerical Evidence for a Conjecture in Real Algebraic Geometry
Homotopies for polynomial systems provide computational evidence for a challenging instance of a conjecture about whether all solutions are real. The implementation of SAGBI homotopies involves polyhedral continuation, at deformation and cheater's ho-motopy. The numerical diiculties are overcome if we work in the true synthetic spirit of the Schubert calculus by selecting the numerically most f...
متن کاملBeyond Polyhedral Homotopies
We present a new algorithmic framework which utilizes tropical geometry and homotopy continuation for solving systems of polynomial equations where some of the polynomials are generic elements in linear subspaces of the polynomial ring. This approach generalizes the polyhedral homotopies by Huber and Sturmfels.
متن کاملZ Paramotopy: Parameter homotopies in parallel
Numerical algebraic geometry provides a number of efficient tools for approximating the solutions of polynomial systems. One such tool is the parameter homotopy, which can be an extremely efficient method to solve numerous polynomial systems that differ only in coefficients, not monomials. This technique is frequently used for solving a parameterized family of polynomial systems at multiple par...
متن کاملSolving Real Polynomial Systems with Real Homotopies
When a real homotopy is used for solving a polynomial system with real coefficients, bifurcation of some of the homotopy paths at singular points is inevitable. The main result of this paper shows that, generically, the solution set of a real homotopy contains no singular point other than a finite number of quadratic turning points. At a quadratic turning point, the bifurcation phenomenon is qu...
متن کاملar X iv : a lg - g eo m / 9 70 60 04 v 1 1 0 Ju n 19 97 NUMERICAL SCHUBERT CALCULUS
We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface Schubert conditions we give two algorithms based on extrinsic deformations of the Grassmannian: one is derived from a Gröbner basis for the Plücker ideal of the G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 133 شماره
صفحات -
تاریخ انتشار 1994